Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm

نویسندگان

چکیده

In this paper we introduce a definition of approximate Pareto efficient solution as well necessary condition for such solutions in the multiobjective setting on Riemannian manifolds. We also propose an inexact proximal point method nonsmooth optimization context by using notion solution. The main convergence result ensures that each cluster (if any) any sequence generated is critical point. Furthermore, when problem convex Hadamard manifold, full weak obtained. As application, show how can be reached limit traps variational rationality approach stay and change human dynamics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inexact Halpern-type proximal point algorithm

We present several strong convergence results for the modified, Halpern-type, proximal point algorithm xn+1 = αnu + (1 − αn)Jβn xn + en (n = 0, 1, . . .; u, x0 ∈ H given, and Jβn = (I + βn A)−1, for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on αn ∈ (0, 1) and βn ∈ (0,∞). These conditions are weaker than those known to us and our results extend and impr...

متن کامل

An Accelerated Inexact Proximal Point Algorithm for Convex Minimization

The proximal point algorithm (PPA) is classical and popular in the community of Optimization. In practice, inexact PPAs which solves the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact PPA with a new inexact criterion for solving convex minimization, and show that the iteration-complexity of this...

متن کامل

Inexact Variants of the Proximal Point Algorithm without Monotonicity

This paper studies convergence properties of inexact variants of the proximal point algorithm when applied to a certain class of nonmonotone mappings. The presented algorithms allow for constant relative errors, in the line of the recently proposed hybrid proximal-extragradient algorithm. The main convergence result extends a recent work of the second author, where exact solutions for the proxi...

متن کامل

An inexact proximal algorithm for variational inequalities

This paper presents a new inexact proximal method for solving monotone variational inequality problems with a given separable structure. The resulting method combines the recent proximal distances theory introduced by Auslender and Teboulle (2006) with a decomposition method given by Chen and Teboulle that was proposed to solve convex optimization problems. This method extends and generalizes p...

متن کامل

Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis

Based on a notion of relatively maximal m -relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing Rockafellar’s theorem 1976 on linear convergence using the proximal point algorithm in a real Hilbert space setting. Convergence analysis, based on this newmodel, is simpler and compact than that of the celebrated technique of R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2022

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-022-04719-y